Conversion of Binary Space Partitioning Trees to Boundary Representation

نویسنده

  • Bruce Naylor
چکیده

Binary Space Partitioning Trees (BSP-Trees) have been proposed as an alternative way to represent polytopes based on the spatial subdivision paradigm. Algorithms that convert from Boundary Representation (BRep) to BSP-Trees have been proposed, but none is known to perform the opposite conversion. In this paper we present such an algorithm, that takes as input a BSP-Tree representation for a polytope and produces a BRep as output. The di culty in designing such algorithm comes from the fact that the information about the boundary is not explicitly represented in the BSP-Tree. The solution we present involves a recursive traversal of the tree to compute lower dimensional information, along with a gluing algorithm that combine the convex regions de ned by the BSP-Tree, removing internal features. A new data structure is proposed (a Topological BSP-Tree), that augments the traditional BSPtree with topological pointers and is used to store intermediate results used in the reconstruction of the BRep.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conversion of Binary Space

Binary Space Partitioning Trees (BSP-Trees) have been proposed as an alternative way to represent polytopes based on the spatial subdivision paradigm. Algorithms that convert from Boundary Representation (BRep) to BSP-Trees have been proposed, but none is known to perform the opposite conversion. In this paper we present such an algorithm , that takes as input a BSP-Tree representation for a po...

متن کامل

Universit a Degli Studi Bijective Dimension-independent Boundary to Interior Mapping with Bsp Trees

In this paper we discuss two algorithms for performing both ways the conversion between the boundary and the interior of d-dimensional polyhedra. Both a d-polyhedron and its (d 1)-faces are represented as BSP trees. An algorithm for boundary to BSP conversion starting from a standard B-rep was given by Thibault and Naylor in [15]. In this paper we assume no structure, no ordering and even no or...

متن کامل

Dimension Independent BSP Section and Interior to Boundary Mapping

In this paper we discuss an algorithm to perform the conversion from the interior to the boundary of d dimensional polyhedra where both the d polyhedron and its d boundary faces are represented as BSP trees This approach allows also to compute the BSP tree of the set intersection between any hyperplane in E and the BSP representation of a d polyhedron If such section hyperplane is the a ne supp...

متن کامل

Dimension-Independent BSP (1): Section and interior-to-boundary Mapping

In this paper we discuss an algorithm to perform the conversion from the interior to the boundary of d-dimensional polyhedra, where both the d-polyhedron and its (d 1) boundary faces are represented as BSP trees. This approach allows also to compute the BSP tree of the set intersection between any hyperplane in Ed and the BSP representation of a d-polyhedron. If such section hyperplane is the a...

متن کامل

Towards Automatic Grid Generation using Binary Space Partition Trees

The problem of discretizing three-dimensional solid objects is considered. The objects may be presented in standard boundary representation. We discuss constructing from this representation a binary space partition tree, a data structure especially wellsuited to the geometric processing needed for grid generation. We also give algorithms for generating fixed-mesh grids and variable-mesh grids a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996